Notes on proof outline logic
نویسنده
چکیده
Formulas of Proof Outline Logic are program texts annotated with assertions. Assertions may contain control predicates as well as terms whose values depend on previous states, making the assertion language rather expressive. The logic is complete for proving safety properties of concurrent programs. A deductive system for the logic is presented. Solutions to the mutual exclusion and readers/writers problems illustrate how the logic can be used as a tool for program development.
منابع مشابه
Applied Logic - CS 4860 - 2018 - Lecture 1
For over two millennia logic developed as a distinct subject in philosophy and mathematics. It is now vitally important in computer science (CS) as well. Logic is essential to guarantee the correctness and safety of software systems on which society increasingly depends. A single coding error or misunderstanding in building a critical system component can and has resulted in disaster. Furthermo...
متن کاملProof-theoretic notions for software maintenance
In this report we give an outline how proof-theoretic notions can be useful for questions related to software maintenance.
متن کاملLecture Notes on Soundness and Correspondence 15-816: Modal Logic
In the lecture 5 we have followed an axiomatic and a semantic approach to modal logic. But do these approaches fit together? We should not be using proof rules that make no sense semantically. Recall the axioms and proof rules we had so far Figure 1. The proof rules are sound iff they can only derive semantical consequences. Note that, unlike in the first lectures, this is an external soundness...
متن کاملApproximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This procedure has a clear semantics and a natural proof theory in the context of Massacci’s modal Single Step Tableaux (SST).
متن کاملThe Contribution of A.v. Kuznetsov to the Theory of Modal Systems and Structures
We will outline the contributions of A.V. Kuznetsov to modal logic. In his research he focused mainly on semantic, i.e. algebraic, issues and lattices of extensions of particular modal logics, though his proof of the Full Conservativeness Theorem for the proof-intuitionistic logic KM (Theorem 17 below) is a gem of proof-theoretic art.
متن کامل